A Multicover Nerve for Geometric Inference
نویسنده
چکیده
We show that filtering the barycentric decomposition of a Čech complex by the cardinality of the vertices captures precisely the topology of k-covered regions among a collection of balls for all values of k. Moreover, we relate this result to the Vietoris-Rips complex to get an approximation in terms of the persistent homology.
منابع مشابه
Modeling environmental indicators for land leveling, using Artificial Neural Networks and Adaptive Neuron-Fuzzy Inference System
Land leveling is one of the most important steps in soil preparation and cultivation. Although land leveling with machines requires considerable amount of energy, it delivers a suitable surface slope with minimal soil deterioration as well as damage to plants and other organisms in the soil. Notwithstanding, in recent years researchers have tried to reduce fossil fuel consumption and its delete...
متن کاملBayes Estimation for a Simple Step-stress Model with Type-I Censored Data from the Geometric Distribution
This paper focuses on a Bayes inference model for a simple step-stress life test using Type-I censored sample in a discrete set-up. Assuming the failure times at each stress level are geometrically distributed, the Bayes estimation problem of the parameters of interest is investigated in the both of point and interval approaches. To derive the Bayesian point estimators, some various balanced lo...
متن کاملModeling environmental indicators for land leveling, using Artificial Neural Networks and Adaptive Neuron-Fuzzy Inference System
Land leveling is one of the most important steps in soil preparation and cultivation. Although land leveling with machines requires considerable amount of energy, it delivers a suitable surface slope with minimal soil deterioration as well as damage to plants and other organisms in the soil. Notwithstanding, in recent years researchers have tried to reduce fossil fuel consumption and its delete...
متن کاملA note on multicovering with disks
In the Disk Multicover problem the input consists of a set P of n points in the plane, where each point p ∈ P has a covering requirement k(p), and a set B of m base stations, where each base station b ∈ B has a weight w(b). If a base station b ∈ B is assigned a radius r(b), it covers all points in the disk of radius r(b) centered at b. The weight of a radii assignment r : B → R is defined as ∑ ...
متن کاملExact Algorithms for Set Multicover and Multiset Multicover Problems
Given a universe N containing n elements and a collection of multisets or sets over N , the multiset multicover (MSMC) or the set multicover (SMC) problem is to cover all elements at least a number of times as specified in their coverage requirements with the minimum number of multisets or sets. In this paper, we give various exact algorithms for these two problems, with or without constraints ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012